Studies on Packing of Powder. I. : Centrifugal Packing
نویسندگان
چکیده
منابع مشابه
On Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملValidation of a digital packing algorithm in predicting powder packing densities
DigiPac is a particle packing algorithm based on a digital approach to represent particle shape, packing space and particle movements. It is capable of packing particles of arbitrary shapes and sizes in a container of arbitrary geometry. A number of case studies have been performed to validate this digital approach, some of which are reported in this paper to show that with DigiPac shape factor...
متن کاملon open packing number of graphs
in a graph g = (v,e), a subset s v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.
متن کاملStrip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...
متن کاملOn the Complexity of Edge Packing and Vertex Packing
This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by EDS ) and the vertex packing problem (denoted by DS ) are linear programming duals of the edge dominating set problem and the dominating set problem respectively. It is shown that these two problems are equivalent to the set packing problem with respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YAKUGAKU ZASSHI
سال: 1969
ISSN: 0031-6903,1347-5231
DOI: 10.1248/yakushi1947.89.7_1013